ciently Searching the Optimal Design Space Stephen

Stephen A. Blythe Robert A. Walker Saint Louis University Kent State University Computer Science Department Mathematics and Computer Science Dept. St. Louis, MO 63156 Kent, OH 44242 Abstract One of the primary advantages of a high-level synthesis system is its ability to explore the design space. This paper presents several methodologies for design space exploration that compute all optimal tradeo points for the combined problem of scheduling, clock length determination, and module selection. We discuss how each methodology takes advantage of both the structure within the design space itself as well as the structure of, and interaction between, each of the three subproblems.